منابع مشابه
Minimum loss scheduling problems
We consider two minimum loss scheduling problems. Let the arrival epochs and processing times of n consecutive jobs be known. The first problem deals with the case these jobs can be processed by m parallel nonidentical machines without waiting room, i.e., a pure loss system. In the second problem there is one machine with a finite waiting room, i.e., a single machine delay-loss system. For both...
متن کاملSolving Project Scheduling Problems by Minimum Cut Computations Solving Project Scheduling Problems by Minimum Cut Computations †
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable pr...
متن کاملSolving Project Scheduling Problems by Minimum Cut Computations
Rolf H. Möhring • Andreas S. Schulz • Frederik Stork • Marc Uetz Fakultät II, Institut für Mathematik, Technische Universität Berlin, Sekr. MA 6-1, Straße des 17. Juni 136, D-10623 Berlin, Germany Sloan School of Management, E53-361, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 ILOG Deutschland GmbH, Ober-Eschbacher Straße 109, D-61352 Bad Hombu...
متن کاملA multi-exchange neighborhood for minimum makespan machine scheduling problems
We propose new local search algorithms for minimum makespan machine scheduling problems, which perform multiple exchanges of jobs among machines. Inspired by the work of Thompson and Orlin (1989) on cyclic transfer neighborhood structures, we model multiple exchanges of jobs as special disjoint cycles and paths in a suitably defined improvement graph, by extending definitions and properties int...
متن کاملMinimum Dissatisfaction Personnel Scheduling
In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a sequence of activities. We are interested in schedules which minimize the overall dissatisfaction, where each employee’s dissatisfaction is modeled as a time-dependent linear function. For the two situations considered we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1992
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)90319-5